Deterministic Genericity for Polynomial Ideals
نویسندگان
چکیده
We consider several notions of genericity appearing in algebraic geometry and commutative algebra. Special emphasis is put on various stability notions which are defined in a combinatorial manner and for which a number of equivalent algebraic characterisations are provided. It is shown that in characteristic zero the corresponding generic positions can be obtained with a simple deterministic algorithm. In positive characteristic, only adapted stable positions are reachable except for quasi-stability which is obtainable in any characteristic.
منابع مشابه
On the Complexity of Search Queries
This paper presents the definitions of several complexity classes of non-deterministic search queries. Classes are defined via two generalizations of the query output tuple problem (used for deterministic queries) to the context of non-deterministic queries. Several taxonomic results are then established. Furthermore, non-deterministic queries are shown not to be in general refinable (i.e., the...
متن کاملQuasi-stability versus Genericity
Quasi-stable ideals appear as leading ideals in the theory of Pommaret bases. We show that quasi-stable leading ideals share many of the properties of the generic initial ideal. In contrast to genericity, quasistability is a characteristic independent property that can be effectively verified. We also relate Pommaret bases to some invariants associated with local cohomology, exhibit the existen...
متن کاملDeterministic polynomial-time test for prime ideals in a Dedekind domain with finite rank
We describe a deterministic polynomial-time test that determining whether a nonzero ideal is a prime ideal in a Dedekind domain with finite rank. The techniques which we used are basis representation of finite rings and the Hermite and Smith normal forms.
متن کاملRecognizing Units in Number Fields
We present a deterministic polynomial-time algorithm that decides whether a power product n¿=i ff is a umt m tne ring of integers of K , where K isa number field, y, are nonzero elements of K and n¡ are rational integers. The main algorithm is based on the factor refinement method for ideals, which might be of independent interest.
متن کاملCastelnuovo-Mumford regularity of products of monomial ideals
Let $R=k[x_1,x_2,cdots, x_N]$ be a polynomial ring over a field $k$. We prove that for any positive integers $m, n$, $text{reg}(I^mJ^nK)leq mtext{reg}(I)+ntext{reg}(J)+text{reg}(K)$ if $I, J, Ksubseteq R$ are three monomial complete intersections ($I$, $J$, $K$ are not necessarily proper ideals of the polynomial ring $R$), and $I, J$ are of the form $(x_{i_1}^{a_1}, x_{i_2}^{a_2}, cdots, x_{i_l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 86 شماره
صفحات -
تاریخ انتشار 2018